On the Uniqueness of Quantum Equilibrium in Bohmian Mechanics S. Goldstein Departments of Mathematics and Physics Rutgers, The State University of New Jersey

Source URL: math.rutgers.edu

• Quantum mechanics
• Position operator
• De BroglieBohm theory
• Laws of science
• Computability theory
• Linear temporal logic
• Redescending M-estimator

ISSNPrint) ISSNOnline) Computer Science for Fun Issue 14

Source URL: www.cs4fn.org

• Alan Turing
• Cryptography
• Turing machine
• Computability theory
• Models of computation
• Codebreaker
• Public-key cryptography
• Known-plaintext attack
• Cipher
• Turing
• Encryption
• Cryptanalysis

The Ackermann Award 2015 Anuj Dawar, Dexter Kozen, and Simona Ronchi Della Rocca Members of the Jury of the EACSL Ackermann Award Abstract The eleventh Ackermann Award is presented at CSL’15 in Berlin, Germany. This ye

Source URL: drops.dagstuhl.de

• Computability theory
• Theory of computation
• Mathematical logic
• EACSL
• Entscheidungsproblem
• Complexity
• Computational complexity theory
• Algorithm
• Decision problem
• Dexter Kozen

Newman’s Typability Algorithm Herman Geuvers1 Radboud University Nijmegen and Eindhoven University of Technology The Netherlands

Source URL: www.cs.ru.nl

• Theoretical computer science
• Formal methods
• Mathematical logic
• Computability theory
• Type theory
• Algorithm
• Lambda calculus
• Combinatory logic
• Set theory
• Gottlob Frege
• Ernst Zermelo

A type system for Continuation Calculus Herman Geuvers joint work with Bram Geron (Birmingham), Wouter Geraedts (Nijmegen), Judith van Stegeren (Nijmegen) Radboud University Nijmegen and

Source URL: www.cs.ru.nl

• Lambda calculus
• Type theory
• Mathematical logic
• Theoretical computer science
• Software engineering
• Computability theory
• System F
• Calculus
• Continuation
• Church encoding
• Deductive lambda calculus

NONCOMPUTABLE CONDITIONAL DISTRIBUTIONS NATHANAEL L. ACKERMAN, CAMERON E. FREER, AND DANIEL M. ROY Abstract. We study the computability of conditional probability, a fundamental notion in probability theory and Bayesian

Source URL: cfreer.org

Scheme-based Theorem Discovery and Concept Invention O. Montano-Rivasa , R. McCaslanda , L. Dixona , A. Bundya a School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street,

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Logic programming
• Logic in computer science
• Computability theory
• Algebraic topology
• Substitution
• Unification
• Lambda calculus
• Sheaf
• Scheme
• Combinatory logic
• Morphism of algebraic varieties

CLASE 2005 Preliminary Version Constructing Induction Rules for Deductive Synthesis Proofs Alan Bundy† 1,2 Lucas Dixon† 3 Jeremy Gow‡ 4 Jacques Fleuriot† 5

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Mathematical logic
• Theoretical computer science
• Computability theory
• Theory of computation
• Recursion
• Type theory
• Structural induction
• Mathematical induction
• Rippling
• Nqthm
• Constructible universe

The Church-Scott representation of inductive and coinductive data in (typed) λ calculus Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Computability theory
• Lambda calculus
• Recursion
• Theoretical computer science
• Type theory
• Combinatory logic
• Church encoding
• Initial algebra
• Primitive recursive function

Resource-Restricted Indifferentiability? Gr´egory Demay, Peter Gaˇzi, Martin Hirt, and Ueli Maurer Department of Computer Science, ETH Zurich, Switzerland {gregory.demay,peter.gazi,hirt,maurer}@inf.ethz.ch Abstract. A

Source URL: pub.ist.ac.at

• Computability theory
• Mathematical logic
• Model theory
• Structure
• Universal algebra
• Reduction
• Symbol
• Sigma-algebra
• Decomposition of spectrum